/*
 * BinaryTree.cpp
 *
 *  Created on: April 22, 2013
 *      Author: Anthony Varghese
 */

#include <iostream>
using std::cout;
using std::endl;
using std::ostream;

#include "BinaryTree.h"

namespace assignment4 {

BinaryTree::BinaryTree(): root(NULL) {

}

BinaryTree::~BinaryTree() {
}

void BinaryTree::add(int d){
}

void BinaryTree::add_inorder(Node* t, int d){
}

void BinaryTree::print_inorder(std::ostream& o, Node*t){
}

void BinaryTree::print_preorder(std::ostream& o, Node*t){
}

void BinaryTree::print_postorder(std::ostream& o, Node*t){
}

std::ostream& operator <<( std::ostream& o, BinaryTree& t){
	o << "Inorder traversal:   ";
	t.print_inorder(o, t.root);

	o << std::endl << "Preorder traversal:  ";
	t.print_preorder(o, t.root);

	o << std::endl << "Postorder traversal: ";
	t.print_postorder(o, t.root);
	o << std::endl;
	return o;
}

} /* namespace assignment4 */
